Combining a Unit Propagation with Genetic Algorithms to Solve max-SAT Problems

In this paper, we propose and investigate a new strategy for max-SAT problems. The proposed approach consists of a unit propagation strategy combined with a genetic algorithm. Based on the two strategies, we hope to propose an exact solver for max-SAT. The principal goal is to reduce the run-time of the unit propagation – based exact method. The latter is applied on partial assignments with few unspecified variables (generated by the genetic algorithm) what gives a very weak effort of the unit propagation compared to the genetic algorithm effort. keywords: genetic algorithms, unit propagation, max-SAT, exact method, metaheurictics, hybridization.